Eigenvalue Decomposition-Based Modified Newton Algorithm
نویسندگان
چکیده
منابع مشابه
A full-Newton step interior-point algorithm based on modified Newton direction
By a modification of the classic-Newton direction in scaled version for linear optimization, we give a new interior-point algorithm based on a very simple function. The algorithm uses full modified-Newton step, thus no need to perform line search. In the processing of the algorithm, the simple function is used to control the searching direction and measure the proximity of iterates to the centr...
متن کاملA Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems
We give the formulation of a Riemannian Newton algorithm for solving a class of nonlinear eigenvalue problems by minimizing a total energy function subject to the orthogonality constraint. Under some mild assumptions, we establish the global and quadratic convergence of the proposed method. Moreover, the positive definiteness condition of the Riemannian Hessian of the total energy function at a...
متن کاملHermite Matrix and Its Eigenvalue-based Decomposition
In the MUSIC approach for multiple emitter location, the array covariance matrix is a Hermite matrix. In order to realize the MUSIC approach, we have to do the work of eigenvalue-based decomposition of the Hermite matrix. This paper proves that the problem of Hermite matrix decomposition can be transformed into the problem of real symmetric matrix decomposition, and the article gives the detail...
متن کاملAdaptive eigenvalue decomposition algorithm for passive acoustic source localization
To find the position of an acoustic source in a room, the relative delay between two (or more) microphone signals for the direct sound must be determined. The generalized cross-correlation method is the most popular technique to do so and is well explained in a landmark paper by Knapp and Carter. In this paper, a new approach is proposed that is based on eigenvalue decomposition. Indeed, the ei...
متن کاملA Decomposition Algorithm for Sparse Generalized Eigenvalue Problem
Sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis and sparse canonical correlation analysis. However, this problem is difficult to solve since it is NP-hard. In this paper, we consider a new decomposition method to tackle this problem. Specifically, we us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2013
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2013/523895